Groups of Ree type in characteristic 3 acting on polytopes
نویسندگان
چکیده
Every Ree group R(q), with q 6= 3 an odd power of 3, is the automorphism group of an abstract regular polytope, and any such polytope is necessarily a regular polyhedron (a map on a surface). However, an almost simple group G with R(q) < G ≤ Aut(R(q)) is not a C-group and therefore not the automorphism group of an abstract regular polytope of any rank.
منابع مشابه
Groups of type L2(q) acting on polytopes
We prove that if G is a string C-group of rank 4 and G ∼= L2(q) with q a prime power, then q must be 11 or 19. The polytopes arising are Grünbaum’s 11-cell of type {3, 5, 3} for L2(11) and Coxeter’s 57-cell of type {5, 3, 5} for L2(19), each a locally projective regular 4-polytope.
متن کاملThe Norm of a Ree Group
We give an explicit construction of the Ree groups of type G2 as groups acting on mixed Moufang hexagons together with detailed proofs of the basic properties of these groups contained in the two fundamental papers of Tits on this subject, [7] and [8]. We also give a short proof that the norm of a Ree group is anisotropic.
متن کاملReflection Groups and Polytopes over Finite Fields, III
When the standard representation of a crystallographic Coxeter group Γ is reduced modulo an odd prime p, one obtains a finite group G acting on some orthogonal space over Zp. If Γ has a string diagram, then G p will often be the automorphism group of a finite abstract regular polytope. In parts I and II we established the basics of this construction and enumerated the polytopes associated to gr...
متن کاملThree-Dimensional Classical Groups Acting on Polytopes
Let V be a 3-dimensional vector space over a finite field. We show that any irreducible subgroup of GL(V ) that arises as the automorphism group of an abstract regular polytope preserves a nondegenerate symmetric bilinear form on V . In particular, the only classical groups on V that arise as automorphisms of such polytopes are the orthogonal groups.
متن کاملLinear Programming, the Simplex Algorithm and Simple Polytopes
In the first part of the paper we survey some far reaching applications of the basis facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concurring the simplex algorithm. We describe sub-exponential randomized pivot roles and upper bounds on the diameter of graphs of polytopes.
متن کامل